Concurrency, Security, and Puzzles by Thomas Gibson-Robinson Philippa Hopcroft & Ranko Lazić

Author:Thomas Gibson-Robinson, Philippa Hopcroft & Ranko Lazić
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Notice that UDPN are a generalization of ordinary P/T nets, which have only one type of token, i.e. . See Fig. 4 for a depiction of an UDPN in the usual Petri net notation.

Fig. 4.An UDPN with places , variables x, y, z and a single transition t. The transition t takes tokens of type x and tokens of type y in places . It puts 1 token of type z onto and 1 token of type y onto .

The Coverability Problem for UDPN is the following decision problem where denotes the transitive and reflexive closure of the step relation.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.